Efficient data abstraction using weighted IB2 prototypes
نویسندگان
چکیده
منابع مشابه
Efficient data abstraction using weighted IB2 prototypes
Data reduction techniques improve the efficiency of k-Nearest Neighbour classification on large datasets since they accelerate the classification process and reduce storage requirements for the training data. IB2 is an effective prototype selection data reduction technique. It selects some items from the initial training dataset and uses them as representatives (prototypes). Contrary to many ot...
متن کاملLearning Weighted Prototypes using Genetic Algorithms
Smith and Osherson proposed the prototype view for concept representation and category cls, Hiflcafion. In the prototype view, concepts are represented as prototypes. A prototype is a collection of salient properties of a conceptUnder the prototype view, a~ instance is classified as a memberofa concept ifit is sufficiently similar to the prototype of this concept. Although the prototype view ha...
متن کاملEvolving Fuzzy Prototypes for Efficient Data Clustering
number of prototypes used to represent each class, the position of each prototype within its class and the membership function associated with each prototype. This paper proposes a novel, evolutionary approach to data clustering and classification which overcomes many of the limitations of traditional systems. The approach rests on the optimisation of both the number and positions of fuzzy prot...
متن کاملEfficient Weighted Model Integration via SMT-Based Predicate Abstraction
Weighted model integration (WMI) is a recent formalism generalizing weighted model counting (WMC) to run probabilistic inference over hybrid domains, characterized by both discrete and continuous variables and relationships between them. Albeit powerful, the original formulation of WMI suffers from some theoretical limitations, and it is computationally very demanding as it requires to explicit...
متن کاملAn efficient weighted nearest neighbour classifier using vertical data representation
The k-nearest neighbour (KNN) technique is a simple yet effective method for classification. In this paper, we propose an efficient weighted nearest neighbour classification algorithm, called PINE, using vertical data representation. A metric called HOBBit is used as the distance metric. The PINE algorithm applies a Gaussian podium function to set weights to different neighbours. We compare PIN...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Science and Information Systems
سال: 2014
ISSN: 1820-0214,2406-1018
DOI: 10.2298/csis140212036o